Epidemics on social network graphs

نویسنده

  • Maria Deijfen
چکیده

This work is concerned with relaxing the assumption of homogeneous mixing in a Reed-Frost epidemic model. After a thorough presentation of the standard Reed-Frost model we introduce social structure in the population by aid of a social network graph and investigate the effects on the epidemic spread. A number of possible choices for the underlying social network are presented: Bernoulli graphs, 3-clique graphs, Markov graphs, Household graphs and small-world networks. For each of these structures we investigate if it can be regarded as a good model for a social network. We also derive asymptotic formulas for epidemiological quantities like the basic reproduction number and the final size of the epidemic. When exact results are beyond reach computer simulations are presented. Department of Mathematics, Stockholm University, SE-10691 Stockholm, Sweden.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What Stops Social Epidemics?

Theoretical progress in understanding the dynamics of spreading processes on graphs suggests the existence of an epidemic threshold below which no epidemics form and above which epidemics spread to a significant fraction of the graph. We have observed information cascades on the social media site Digg that spread fast enough for one initial spreader to infect hundreds of people, yet end up affe...

متن کامل

On existence of triangles, clustering, and small-world property of random key graphs

Random key graphs have been introduced about a decade ago in the context of key predistribution schemes for securing wireless sensor networks (WSNs). They have received much attention recently with applications spanning the areas of recommender systems, epidemics in social networks, cryptanalysis, and clustering and classification analysis. This paper is devoted to analyzing various properties ...

متن کامل

The Spread of Epidemics on Random Graphs: A Modified Bass Model for Product Growth in Networks (Working Paper)

Many products and innovations become widespread through the social interaction of individuals in a population. Predicting the growth rate of adoption of a product is crucial for demand management and sales. Bass model has been widely used to model the temporal evulsion of the adoption in such social systems. In such a model, the likelihood of a new adoption is linearly related to the number of ...

متن کامل

finding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory

In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...

متن کامل

Epidemics on Small-World Networks

This paper reviews the use of graphs as mathematical descriptions of social networks, and discusses in particular some properties of the commonly used random (Erdős-Rényi), small-world (Watts-Strogatz) and scale-free (power-law) models, with particular focus on the small-world model. The applications of such networks to epidemiology are then briefly outlined with some comments pertaining to the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000